Multilevel Kerninghan/Lin: ParMETIS
نویسنده
چکیده
Graph partitioning has become an important facet of computer science with its applications in many disciplines. Graph partitioning is NPcomplete and has given rise to many heuristic algorithms in order to achieve the best estimate in a decent amount of time. ParMETIS is an MPI-based parallel library that implements the heuristic multilevel Kerninghan/Lin algorithm to partition and repartition unstructured graphs.
منابع مشابه
Shape optimizing load balancing for MPI-parallel adaptive numerical simulations
Load balancing is important for the efficient execution of numerical simulations on parallel computers. In particular when the simulation domain changes over time, the mapping of computational tasks to processors needs to be modified accordingly. Most state-of-the-art libraries addressing this problem are based on graph repartitioning with a parallel variant of the Kernighan-Lin (KL) heuristic....
متن کاملShape Optimizing Load Balancing for Parallel Adaptive Numerical Simulations Using MPI
Load balancing is an important requirement for the efficient execution of numerical simulations on parallel computers. In particular when the simulation domain changes over time, the mapping of computational tasks to processors needs to be modified accordingly. Most stateof-the-art libraries addressing this problem are based on graph repartitioning with a parallel variant of the Kernighan-Lin (...
متن کاملA refinement-tree based partitioning method for dynamic load balancing with adaptively refined grids
The partitioning of an adaptive grid for distribution over parallel processors is considered in the context of adaptive multilevel methods for solving partial differential equations. A partitioning method based on the refinement-tree is presented. This method applies to most types of grids in two and three dimensions. For triangular and tetrahedral grids, it is guaranteed to produce connected p...
متن کاملToward a scalable refinement strategy for multilevel graph repartitioning
Dynamic load balancing is a mandatory feature for parallel software whose workload evolves with time, such as solvers implementing adaptive mesh refinement. In such solvers, problem space is most often represented as an unstructured mesh, and graph partitioning is used to distribute data and their associated computations across processes. The purpose of this paper is to study the sequential ver...
متن کاملA global, distributed ordering library
Computing a fill-reducing ordering of a sparse matrix is a critical step for sparse direct solvers. In the early days of the field, “bottom-up” or “greedy” methods were popular. These include the Minimum Degree algorithm [7] and its variants, and profile-reducing methods such as the Cuthill-McKee algorithm [2]. More recently, “top-down” or “divide-and-conquer” methods such as Nested Dissection ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999